On zeros of the characteristic polynomial of matroids of bounded tree-width

نویسندگان

  • Carolyn Chun
  • Rhiannon Hall
  • Criel Merino
  • Steven D. Noble
چکیده

We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power q and constant k, the characteristic polynomial of any loopless, GF (q)representable matroid with tree-width k has no real zero greater than qk−1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tutte Polynomial for Matroids of Bounded Branch-Width

It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...

متن کامل

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width

Motivated by the ‘subgraphs world’ view of the ferromagnetic Ising model, we analyse the mixing times of Glauber dynamics based on subset expansion expressions for classes of graph, hypergraph and matroid polynomials. With a canonical paths argument, we demonstrate that the chains defined within this framework mix rapidly upon graphs, hypergraphs and matroids of bounded tree-width. This extends...

متن کامل

Amalgam Width of Matroids

We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing the algorithmic application on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order lo...

متن کامل

Monadic second-order model-checking on decomposable matroids

A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the polynomial time model checking of MSOM on representable matroids of bounded branch-width, by reduction to MSO on trees, much simpler than the one previously known. We deduce results about spectrum of MSOM formulas and enumeration on matroids of bounded branch-width. We ...

متن کامل

LINEAR ESTIMATE OF THE NUMBER OF ZEROS OF ABELIAN INTEGRALS FOR A KIND OF QUINTIC HAMILTONIANS

We consider the number of zeros of the integral $I(h) = oint_{Gamma_h} omega$ of real polynomial form $omega$ of degree not greater than $n$ over a family of vanishing cycles on curves $Gamma_h:$ $y^2+3x^2-x^6=h$, where the integral is considered as a function of the parameter $h$. We prove that the number of zeros of $I(h)$, for $0 < h < 2$, is bounded above by $2[frac{n-1}{2}]+1$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2017